home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
ftp.cs.arizona.edu
/
ftp.cs.arizona.edu.tar
/
ftp.cs.arizona.edu
/
icon
/
newsgrp
/
group03a.txt
/
000011_icon-group-sender_Tue Feb 11 16:44:02 2003.msg
< prev
next >
Wrap
Internet Message Format
|
2003-12-22
|
1KB
Return-Path: <icon-group-sender>
Received: (from root@localhost)
by baskerville.CS.Arizona.EDU (8.11.1/8.11.1) id h1BNfU917274
for icon-group-addresses; Tue, 11 Feb 2003 16:41:30 -0700 (MST)
Message-Id: <200302112341.h1BNfU917274@baskerville.CS.Arizona.EDU>
From: ernobe <ernobe@yahoo.com>
X-Newsgroups: comp.lang.icon
Subject: Re: data values
Date: Tue, 11 Feb 2003 15:34:38 -0600
User-Agent: Noworyta News Reader/2.9
To: icon-group@cs.arizona.edu
Errors-To: icon-group-errors@cs.arizona.edu
Status: RO
[In the implementation book,] in Chapter 2, page 17, there appears that,
"Except in such specific situations, expressions are not bounded". The
specific situations mentioned are the if-clause and the control clauses
of loops. The confusion here is that the if expressions and loops are
also themselves expressions, and when they do not appear as arguments to
other expressions they are bounded. The previous mention of unbounded
expressions referred to them as arguments to be evaluated (p.16) which
was seen to resemble a logical conjunction (p.15). All of which leads
us to the conclusion that a clearer statement than the one cited would
be "Except in such specific situations, logical expressions are not
bounded."